Optimal sequential wireless relay placement on a random lattice path
نویسندگان
چکیده
منابع مشابه
Optimal Sequential Wireless Relay Placement on a Random Lattice Path
Our work is motivated by impromptu (or “as-you-go”) deployment of wireless relay nodes along a path, a need that arises in many situations. In this paper, the path is modeled as starting at the origin (where there is the data sink, e.g., the control centre), and evolving randomly over a lattice in the positive quadrant. A person walks along the path deploying relay nodes as he goes. At each ste...
متن کاملOptimal Impromptu Deployment of A Multi-Hop Wireless Network On a Random Lattice Path
We consider the problem of impromptu deployment of a multihop wireless network as a deployment operative steps along a random lattice path, with a Markov evolution. At each step, with various probabilities, the path can either continue in the same direction or can take a turn “North” or “East,” or can come to an end, at which point a sensor needs to be placed to send some measurements to a base...
متن کاملOptimal power-aware relay placement for cooperative wireless sensor networks
We study the problem of optimizing the symbol error probability (SEP) performance of cluster-based cooperative wireless sensor networks. Recent studies in literature show that an efficient relay selection protocol based on simple geographical information of the nodes to execute cooperative diversity can significantly improve the SEP performance at the destination of such networks. As well, simi...
متن کاملOptimal Node Placement in Multiple Relay Wireless Networks
This thesis explores the optimal node placement for linear Gaussian multiple relay networks of an arbitrary size and with one source-destination pair. Consider the model that signal attenuation grows in magnitude as 1 dδ with distance d in the low attenuation regime (path loss exponent δ < 3/2). Under the condition that the minimum achievable rate from source to destination is maintained, we de...
متن کاملOptimal Capacity Relay Node Placement in a Multi-hop Wireless Network on a Line
We use information theoretic achievable rate formulas for the multi-relay channel to study the problem of optimal placement of relay nodes along the straight line joining a source node and a sink node. The achievable rate formulas that we use are for full-duplex radios at the relays and decodeand-forward relaying. For the single relay case, and individual power constraints at the source node an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ad Hoc Networks
سال: 2014
ISSN: 1570-8705
DOI: 10.1016/j.adhoc.2014.04.005